云计算开源生态知识共享及风险治理的演化博弈研究

云计算开源生态正在逐步形成,促进知识共享、规避开源风险成为开源运营及开源治理的重要目标。本文基于演化博弈理论,构建了行业自律和政府监管两种治理机制下多方利益相关者(云计算企业、产业联盟以及政府)之间的演化博弈模型,分析了关键参数对各方策略及系统收益的影响。研究发现,在行业自律机制下,违约金和基金会补贴会促进知识共享合作,而产业联盟对于风险的存在则更为敏感。在政府监管机制下,罚款和政府补贴可以帮助参与者平衡风险并促进知识共享合作。研究结果可为云计算开源生态的可持续发展提供决策参考。     

Cooperative spectrum sharing MIMO systems with successive decoding

A spectrum sharing system with primary and secondary nodes, each equipped with an arbitrary number of antennas, is investigated. Particularly, the outage performance of an underlay cognitive system is analytically studied, in the case when the end-to-end ($e2e$) communication is established via an intermediate relay node. To better enhance the $e2e$ communication, successive interference cancellation (SIC) is adopted, which compensates for both the transmission power constraint and the presence of interference from primary nodes. Both the relay and secondary receiver perform unordered SIC to successively decode the multiple streams, whereas the decode-and-forward relaying protocol is used for the $e2e$ communication. New closed-form expressions for the $e2e$ outage performance of each transmitted stream are derived in terms of finite sum series of the Tricomi confluent hypergeometric function. In addition, simplified yet tight approximations for the asymptotic outage performance are obtained. Useful engineering insights are manifested, such as the diversity order of the considered system and the impact of interference from the primary nodes in conjunction with the constrained transmission power of the secondary nodes.     

On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

On meromorphic functions that share three values of finite weights

A uniqueness theorem for two distinct non-constant meromorphic functions that share three values of finite weights is proved, which generalizes two previous results by H.X. Yi, and X.M. Li and H.X. Yi. As applications of it, many known results by H.X. Yi and P. Li, etc. could be improved. Furthermore, with the concept of finite-weight sharing, extensions on Osgood-Yang's conjecture and Mues' conjecture, and a generalization of some prevenient results by M. Ozawa and H. Ueda, ect. could be obtained.     

基于演化博弈的武器装备研制合同定价模型研究

针对合同的动态性，提出利用基于演化博弈建立定价模型。考虑到决策群体中个体的认识误差，对所建立的定价模型进行修正，建立带偏离的定价模型并分析了偏离对均衡解的影响。最后将以上模型应用实例进行比较分析。     

收入管理的MMV动态拍卖机制研究

随着互联网上交易的增多,多单位同质产品销售的拍卖机制成为了一个新的研究方向.针对易逝性服务产品的收入管理问题,提出将产品销售分为多个拍卖期的MMV(Multi-period and Multi-unit Vickrey(Auction with Reserve Pricing)动态拍卖机制,给出每期最优拍卖单位数和保留价格的确定方法,证明了最优拍卖单位数分别关于剩余存量和销售时间单增的性质,以及保留价格关于剩余存量的单降性.最后证明MMV机制的每期实际成交价格将高于Vulcano(2002)提出的MSP(Modified Second-Price)机制,根据易逝性服务产品的需求特点得到MMV机制优于MSP机制的结论.     

基于遗传算法的座位优化控制模型

座位优化控制是航空运输界增加利润的有效方法 .基于旅客的需求预测 ,可以利用数学规划模型为不同的航段和票价组合计算座位销售上限或者销售竞价 ,从而达到单个航班收入最大化的目的 .常用的方法可分为确定模型和概率模型 ,但对多航段多舱位的优化问题 ,由于出现了复杂的组合和约束 ,这些模型必须简化 .提出了基于遗传算法的座位优化控制模型 ,并和常用的优化方法进行了仿真对比 .研究结果表明 ,遗传算法应用于座位优化 ,可得到满意的解 ,同时 ,遗传算法简化了复杂的约束关系 ,易于实现 ,具有明显的优势 .     

基于团队的知识共享和知识形成机理研究

越来越多的企业开始采用以团队为基础的组织结构，团队的核心能力在于能够实现知识共享，因此对团队知识共享及形成进行研究有着重要意义。本在阐述以团队为基础的组织与官僚层级制组织相比更有利于知识共享的基础上，从心理学和经济学的角度分析了团队知识共享的理论基础，指出了团队知识管理的三个误区，并首次提出了团队知识形成的三种机制和途径：事前学习、事中学习和外部学习。     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.